Improving the Associative Rule Chaining Architecture

نویسندگان

  • Nathan Burles
  • Simon O'Keefe
  • Jim Austin
چکیده

This paper describes improvements to the rule chaining architecture presented in [1]. The architecture uses distributed associative memories to allow the system to utilise memory efficiently, and superimposed distributed representations in order to reduce the time complexity of a tree search to O(d), where d is the depth of the tree. This new work reduces the memory required by the architecture, and can also further reduce the time complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Associative Rule Chaining Architecture for Multiple Arity Rules

The Associative Rule Chaining Architecture uses distributed associative memories and superimposed distributed representations in order to perform rule chaining efficiently [Austin et al., 2012]. Previous work has focused on rules with only a single antecedent, in this work we extend the architecture to work with multiple-arity rules and show that it continues to operate effectively.

متن کامل

A Rule Chaining Architecture Using a Correlation Matrix Memory

This paper describes an architecture based on superimposed distributed representations and distributed associative memories which is capable of performing rule chaining. The use of a distributed representation allows the system to utilise memory efficiently, and the use of superposition reduces the time complexity of a tree search to O(d), where d is the depth of the tree. Our experimental resu...

متن کامل

Workshop Chairs and Organizers External Reviewers a Lightweight Architecture of an Eca Rule Engine for Web Browsers 2 the Architecture of an Eca Rule Engine for Web Browsers 2.1 the Components View

There is a large literature concerning rule engines (forward chaining or backward chaining). During the last thirty years there were various proposals such as RETE, TREAT and the derived Gator algorithm. Significantly, RETE was embedded into various expert systems such as Clips and its successor Jess, and Drools including in a number of commercial rule engines and was extended various times inc...

متن کامل

A Lightweight Architecture of an ECA Rule Engine for Web Browsers

There is a large literature concerning rule engines (forward chaining or backward chaining). During the last thirty years there were various proposals such as RETE, TREAT and the derived Gator algorithm. Significantly, RETE was embedded into various expert systems such as Clips and its successor Jess, and Drools including in a number of commercial rule engines and was extended various times inc...

متن کامل

Type-2 Fuzzy Hybrid Expert System For Diagnosis Of Degenerative Disc Diseases

One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013